CIESIELSKI, KALLA, ZENG: TAYLOR EXPANSIONDIAGRAMS: A COMPACT CANONICAL REPRESENTATIONFOR ARITHMETIC EXPRESSIONS 1 Taylor Expansion Diagrams: A Compact Canonical Representation for Arithmetic Expressions
نویسندگان
چکیده
This paper presents a new, compact, canonical representation for arithmetic expressions, called Taylor Expansion Diagram. It can be used to facilitate the verification of RTL specifications and hardware implementations of arithmetic designs, and specifically the equivalence checking of complex algebraic and arithmetic expressions that arise in symbolic verification. This new representation is based on an entirely new, non-binary decomposition principle. It treats the expression as a continuous, differentiable function over symbolic (algebraic) variables and applies Taylor series expansion recursively over its variables. The resulting Taylor Expansion Diagram (TED), is canonical for a fixed ordering of variables. We present a theory of TED, and show how to obtain the reduced, normalized representation. We demonstrate that it has linear space complexity for arbitrarily complex polynomials, while time complexity to generate the representation is comparable to that of *BMD. This is the first representation known to us that allows to represent complex arithmetic functions in linear space. We believe that the proposed representation will have serious impact on symbolic verification methods as it can significantly enhance the verification process for RTL designs containing arithmetic circuits.
منابع مشابه
Improving Logic-level Representation of Taylor Expansion Diagram Using Attributed Edges
Abstract– Formal verification of complex digital systems requires a mechanism for efficient representation and manipulation of arithmetic as well as random Boolean functions. Although the Taylor Expansion Diagram can be used effectively to represent arithmetic expressions at the vector level, it is not efficient in the use of memory for representing bit-level logic expressions. In this paper, w...
متن کاملArithmetic Transforms for Verifying Compositions of Sequential Datapaths
In this paper, we address the issue of obtaining compact canonical representations of datapath circuits with sequential elements, for the purpose of equivalence checking. First, we demonstrate the mechanisms for efficient compositional construction of Arithmetic Transform (AT), which is the underlying function representation, used in modern word-level decision diagrams. Second, we introduce a w...
متن کاملLTED: A Canonical and Compact Hybrid Word- Boolean Representation as a Formal Model for Hardware/Software Co-designs
In this paper, we describe a hybrid bitand word-level representation called Linear Taylor Expansion Diagram (LTED) [1]. This representation not only has a compact and canonical form, but also is close to hardware-software descriptions so that it can be utilized as a formal model for formal verification and synthesis. The power of abstraction of LTED allows us to represent system level of hardwa...
متن کاملPath-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted functions. We assume that conditionals are abstracted as boolean variables, which may be repeated to reflect equivalent conditionals. We introduce free conditional expression diagrams (FCEDs), which extend binary decisio...
متن کاملEvaluation of -valued Fixed Polarity Generalizations of Reed-Muller Canonical Form
This paper compares the complexity of three different fixed polarity generalizations of Reed-Muller canonical form to multiple-valued logic: the Galois Field-based expansion introduced by Green and Taylor, the Reed-MullerFourier form of Stanković and Moraga, and the expansion over addition modulo , minimum and the set of all literal operators introduced by the author and Muzio. An algorithm for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001